Lattices in Computer Science Lecture 5 Some basic complexity results
نویسندگان
چکیده
Recall that in the closest vector problem we are given a lattice and a target vector (which is usually not in the lattice) and we are supposed to find the lattice point that is closest to the target point. More precisely, one can consider three variants of the CVP, depending on whether we have to actually find the closest vector, find its distance, or only decide if it is closer than some given number:
منابع مشابه
Concept Lattices and Their Applications, Fourth International Conference, CLA 2006, Tunis, Tunisia, October 30 - November 1, 2006, Selected Papers
In what case do you like reading so much? What about the type of the concept lattices and their applications fourth international conference cla 2006 tunis tunisia october 30 november 1 2006 selected papers lecture notes in artificial intelligence book? The needs to read? Well, everybody has their own reason why should read some books. Mostly, it will relate to their necessity to get knowledge ...
متن کاملCSE 206 A : Lattice Algorithms and Applications Spring 2007 Lecture 2 : Lattices and Bases
Motivated by the many applications described in the first lecture, today we start a systematic study of point lattices and related algorithm. Geometrically, a lattice can be defined as the set of intersection point of an infinite, regular, but not necessarily orthogonal n-dimensional grid. For example, the set of integer vectors Z n is a lattice. In computer science, lattices are usually repres...
متن کاملAround Kolmogorov complexity: basic notions and results
Algorithmic information theory studies description complexity and randomness and is now a well known field of theoretical computer science and mathematical logic. There are several textbooks and monographs devoted to this theory [4, 1, 5, 2, 7] where one can find the detailed exposition of many difficult results as well as historical references. However, it seems that a short survey of its basi...
متن کاملLattices in Computer Science Lecture 2 LLL Algorithm
Lattices in Computer Science Lecture 2 LLL Algorithm Lecturer: Oded Regev Scribe: Eyal Kaplan In this lecture1 we describe an approximation algorithm to the Shortest Vector Problem (SVP). This algorithm, developed in 1982 by A. K. Lenstra, H. W. Lenstra, Jr. and L. Lovasz, usually called the LLL algorithm, gives a ( 2 √ 3 ) n approximation ratio, where n is the dimension of the lattice. In many...
متن کاملLecture 7 : Expanders
In this lecture we give basic background about expander graphs. Expanders are graphs with strong connectivity properties: every two large subsets of vertices in an expander have many edges connecting them. Surprisingly, one can construct very sparse graphs that are expanders, and this is what makes them so useful. Expanders have a huge number of applications in theoretical computer science: in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005